On Polyhedral Projection and Parametric Programming
نویسندگان
چکیده
منابع مشابه
Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
Let a polyhedral convex set be given by a finite number of linear inequalities and consider the problem to project this set onto a subspace. This problem, called polyhedral projection problem, is shown to be equivalent to multiple objective linear programming. The number of objectives of the multiple objective linear program is by one higher than the dimension of the projected polyhedron. The r...
متن کاملLogical Inference and Polyhedral Projection
We explore connections between polyhedral projection and inference in propositional logic We formulate the problem of drawing all inferences that contain a restricted set of atoms i e all inferences that pertain to a given question as a logical projection problem We show that polyhedral projection partially solves this problem and in particular derives precisely those inferences that can be obt...
متن کاملPolyhedral Analysis Using Parametric Objectives
The abstract domain of polyhedra lies at the heart of many program analysis techniques. However, its operations can be expensive, precluding their application to polyhedra that involve many variables. This paper describes a new approach to computing polyhedral domain operations. The core of this approach is an algorithm to calculate variable elimination (projection) based on parametric linear p...
متن کاملParametric Analysis of Polyhedral Iteration
In the area of automatic parallelization of programs, analyzing and transforming loop nests with parametric aane loop bounds requires fundamental mathematical results. The most common geometrical model of iteration spaces, called the polytope model, is based on mathematics dealing with convex and discrete geometry, linear programming, combinatorics and geometry of numbers. In this paper, we pre...
متن کاملLinear Programming and Polyhedral Combinatorics
This is a special case of a projection onto a linear space (here, we consider only coordinate projection). By repeatedly projecting, we can eliminate any subset of coordinates. We claim that Pk is also a polyhedron and this can be proved by giving an explicit description of Pk in terms of linear inequalities. For this purpose, one uses Fourier-Motzkin elimination. Let P = {x : Ax ≤ b} and let •...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 2008
ISSN: 0022-3239,1573-2878
DOI: 10.1007/s10957-008-9384-4